0.04/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.10	% Command    : run_E %s %d THM
0.08/0.31	% Computer : n006.cluster.edu
0.08/0.31	% Model    : x86_64 x86_64
0.08/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.31	% Memory   : 8042.1875MB
0.08/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.08/0.31	% CPULimit   : 1440
0.08/0.31	% WCLimit    : 180
0.08/0.31	% DateTime   : Thu Jul  4 10:16:09 EDT 2024
0.08/0.31	% CPUTime    : 
0.15/0.42	Running higher-order theorem proving
0.66/0.88	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p
15.44/4.09	# Version: 3.2.0-ho
15.44/4.09	# Preprocessing class: HMLMSMSLSSLNSFA.
15.44/4.09	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
15.44/4.09	# Starting new_bool_1 with 900s (5) cores
15.44/4.09	# Starting post_as_ho6 with 180s (1) cores
15.44/4.09	# Starting post_as_ho8 with 180s (1) cores
15.44/4.09	# Starting pre_casc_4 with 180s (1) cores
15.44/4.09	# new_bool_1 with pid 5424 completed with status 0
15.44/4.09	# Result found by new_bool_1
15.44/4.09	# Preprocessing class: HMLMSMSLSSLNSFA.
15.44/4.09	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
15.44/4.09	# Starting new_bool_1 with 900s (5) cores
15.44/4.09	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
15.44/4.09	# Search class: HGHSM-SMLM32-DSFFFFNN
15.44/4.09	# partial match(1): HGHSM-SMLM32-DSFFFFBN
15.44/4.09	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
15.44/4.09	# Starting post_as_ho7 with 541s (1) cores
15.44/4.09	# Starting post_as_ho8 with 91s (1) cores
15.44/4.09	# Starting full_lambda_3 with 91s (1) cores
15.44/4.09	# Starting post_as_ho6 with 91s (1) cores
15.44/4.09	# Starting new_bool_1 with 86s (1) cores
15.44/4.09	# post_as_ho6 with pid 5434 completed with status 0
15.44/4.09	# Result found by post_as_ho6
15.44/4.09	# Preprocessing class: HMLMSMSLSSLNSFA.
15.44/4.09	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
15.44/4.09	# Starting new_bool_1 with 900s (5) cores
15.44/4.09	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
15.44/4.09	# Search class: HGHSM-SMLM32-DSFFFFNN
15.44/4.09	# partial match(1): HGHSM-SMLM32-DSFFFFBN
15.44/4.09	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
15.44/4.09	# Starting post_as_ho7 with 541s (1) cores
15.44/4.09	# Starting post_as_ho8 with 91s (1) cores
15.44/4.09	# Starting full_lambda_3 with 91s (1) cores
15.44/4.09	# Starting post_as_ho6 with 91s (1) cores
15.44/4.09	# Preprocessing time       : 0.025 s
15.44/4.09	# Presaturation interreduction done
15.44/4.09	
15.44/4.09	# Proof found!
15.44/4.09	# SZS status Theorem
15.44/4.09	# SZS output start CNFRefutation
15.44/4.09	thf(decl_sort1, type, del: $tType).
15.44/4.09	thf(decl_22, type, bool: del).
15.44/4.09	thf(decl_24, type, arr: del > del > del).
15.44/4.09	thf(decl_25, type, mem: $i > del > $o).
15.44/4.09	thf(decl_26, type, ap: $i > $i > $i).
15.44/4.09	thf(decl_28, type, p: $i > $o).
15.44/4.09	thf(decl_408, type, c_2Epred__set_2ECHOICE: del > $i).
15.44/4.09	thf(decl_411, type, c_2Epred__set_2EDELETE: del > $i).
15.44/4.09	thf(decl_434, type, c_2Epred__set_2EREST: del > $i).
15.44/4.09	thf(decl_437, type, c_2Epred__set_2ESUBSET: del > $i).
15.44/4.09	thf(decl_465, type, esk1_0: del).
15.44/4.09	thf(decl_466, type, esk2_0: $i).
15.44/4.09	thf(ap_tp, axiom, ![X1:del, X2:del, X3:$i]:((![X4:$i]:(((mem @ (ap @ X3 @ X4) @ X2)<=(mem @ X4 @ X1)))<=(mem @ X3 @ (arr @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p', ap_tp)).
15.44/4.09	thf(conj_thm_2Epred__set_2EDELETE__SUBSET, axiom, ![X13:del, X14:$i]:((![X169:$i]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X13) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X13) @ X169) @ X14)) @ X169))<=(mem @ X169 @ (arr @ X13 @ bool))))<=(mem @ X14 @ X13))), file('/export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p', conj_thm_2Epred__set_2EDELETE__SUBSET)).
15.44/4.09	thf(ax_thm_2Epred__set_2EREST__DEF, axiom, ![X13:del, X170:$i]:((((ap @ (c_2Epred__set_2EREST @ X13) @ X170)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X13) @ X170) @ (ap @ (c_2Epred__set_2ECHOICE @ X13) @ X170)))<=(mem @ X170 @ (arr @ X13 @ bool)))), file('/export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p', ax_thm_2Epred__set_2EREST__DEF)).
15.44/4.09	thf(mem_c_2Epred__set_2ECHOICE, axiom, ![X13:del]:((mem @ (c_2Epred__set_2ECHOICE @ X13) @ (arr @ (arr @ X13 @ bool) @ X13))), file('/export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p', mem_c_2Epred__set_2ECHOICE)).
15.44/4.09	thf(conj_thm_2Epred__set_2EREST__SUBSET, conjecture, ![X13:del, X170:$i]:(((mem @ X170 @ (arr @ X13 @ bool))=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X13) @ (ap @ (c_2Epred__set_2EREST @ X13) @ X170)) @ X170)))), file('/export/starexec/sandbox2/tmp/tmp.atCkawHsja/E---3.1_5345.p', conj_thm_2Epred__set_2EREST__SUBSET)).
15.44/4.09	thf(c_0_5, plain, ![X1:del, X2:del, X3:$i]:(((mem @ X3 @ (arr @ X1 @ X2))=>![X4:$i]:(((mem @ X4 @ X1)=>(mem @ (ap @ X3 @ X4) @ X2))))), inference(fof_simplification,[status(thm)],[ap_tp])).
15.44/4.09	thf(c_0_6, plain, ![X13:del, X14:$i]:(((mem @ X14 @ X13)=>![X169:$i]:(((mem @ X169 @ (arr @ X13 @ bool))=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X13) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X13) @ X169) @ X14)) @ X169)))))), inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EDELETE__SUBSET])).
15.44/4.09	thf(c_0_7, plain, ![X13:del, X170:$i]:(((mem @ X170 @ (arr @ X13 @ bool))=>((ap @ (c_2Epred__set_2EREST @ X13) @ X170)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X13) @ X170) @ (ap @ (c_2Epred__set_2ECHOICE @ X13) @ X170))))), inference(fof_simplification,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])).
15.44/4.09	thf(c_0_8, plain, ![X3389:del, X3390:del, X3391:$i, X3392:$i]:((~(mem @ X3391 @ (arr @ X3389 @ X3390))|(~(mem @ X3392 @ X3389)|(mem @ (ap @ X3391 @ X3392) @ X3390)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
15.44/4.09	thf(c_0_9, plain, ![X3513:del]:((mem @ (c_2Epred__set_2ECHOICE @ X3513) @ (arr @ (arr @ X3513 @ bool) @ X3513))), inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE])).
15.44/4.09	thf(c_0_10, negated_conjecture, ~(![X13:del, X170:$i]:(((mem @ X170 @ (arr @ X13 @ bool))=>(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X13) @ (ap @ (c_2Epred__set_2EREST @ X13) @ X170)) @ X170))))), inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET])).
15.44/4.09	thf(c_0_11, plain, ![X3521:del, X3522:$i, X3523:$i]:((~(mem @ X3522 @ X3521)|(~(mem @ X3523 @ (arr @ X3521 @ bool))|(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X3521) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X3521) @ X3523) @ X3522)) @ X3523))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
15.44/4.09	thf(c_0_12, plain, ![X3431:del, X3432:$i]:((~(mem @ X3432 @ (arr @ X3431 @ bool))|((ap @ (c_2Epred__set_2EREST @ X3431) @ X3432)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X3431) @ X3432) @ (ap @ (c_2Epred__set_2ECHOICE @ X3431) @ X3432))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
15.44/4.09	thf(c_0_13, plain, ![X2:del, X4:$i, X3:$i, X1:del]:(((mem @ (ap @ X3 @ X4) @ X2)|~((mem @ X3 @ (arr @ X1 @ X2)))|~((mem @ X4 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
15.44/4.09	thf(c_0_14, plain, ![X1:del]:((mem @ (c_2Epred__set_2ECHOICE @ X1) @ (arr @ (arr @ X1 @ bool) @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
15.44/4.09	thf(c_0_15, negated_conjecture, ((mem @ esk2_0 @ (arr @ esk1_0 @ bool))&~(p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0)) @ esk2_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
15.44/4.09	thf(c_0_16, plain, ![X4:$i, X3:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ (ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X4) @ X3)) @ X4))|~((mem @ X3 @ X1))|~((mem @ X4 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_11])).
15.44/4.09	thf(c_0_17, plain, ![X3:$i, X1:del]:((((ap @ (c_2Epred__set_2EREST @ X1) @ X3)=(ap @ (ap @ (c_2Epred__set_2EDELETE @ X1) @ X3) @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X3)))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_12])).
15.44/4.09	thf(c_0_18, plain, ![X3:$i, X1:del]:(((mem @ (ap @ (c_2Epred__set_2ECHOICE @ X1) @ X3) @ X1)|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
15.44/4.09	thf(c_0_19, negated_conjecture, ~((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ esk1_0) @ (ap @ (c_2Epred__set_2EREST @ esk1_0) @ esk2_0)) @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_15])).
15.44/4.09	thf(c_0_20, plain, ![X3:$i, X1:del]:(((p @ (ap @ (ap @ (c_2Epred__set_2ESUBSET @ X1) @ (ap @ (c_2Epred__set_2EREST @ X1) @ X3)) @ X3))|~((mem @ X3 @ (arr @ X1 @ bool))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
15.44/4.09	thf(c_0_21, negated_conjecture, (mem @ esk2_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_15])).
15.44/4.09	thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])]), ['proof']).
15.44/4.09	# SZS output end CNFRefutation
15.44/4.09	# Parsed axioms                        : 2697
15.44/4.09	# Removed by relevancy pruning/SinE    : 2141
15.44/4.09	# Initial clauses                      : 2096
15.44/4.09	# Removed in clause preprocessing      : 965
15.44/4.09	# Initial clauses in saturation        : 1131
15.44/4.09	# Processed clauses                    : 3366
15.44/4.09	# ...of these trivial                  : 38
15.44/4.09	# ...subsumed                          : 742
15.44/4.09	# ...remaining for further processing  : 2586
15.44/4.09	# Other redundant clauses eliminated   : 189
15.44/4.09	# Clauses deleted for lack of memory   : 0
15.44/4.09	# Backward-subsumed                    : 32
15.44/4.09	# Backward-rewritten                   : 24
15.44/4.09	# Generated clauses                    : 65662
15.44/4.09	# ...of the previous two non-redundant : 64650
15.44/4.09	# ...aggressively subsumed             : 0
15.44/4.09	# Contextual simplify-reflections      : 6
15.44/4.09	# Paramodulations                      : 65384
15.44/4.09	# Factorizations                       : 6
15.44/4.09	# NegExts                              : 37
15.44/4.09	# Equation resolutions                 : 202
15.44/4.09	# Disequality decompositions           : 0
15.44/4.09	# Total rewrite steps                  : 6801
15.44/4.09	# ...of those cached                   : 6488
15.44/4.09	# Propositional unsat checks           : 0
15.44/4.09	#    Propositional check models        : 0
15.44/4.09	#    Propositional check unsatisfiable : 0
15.44/4.09	#    Propositional clauses             : 0
15.44/4.09	#    Propositional clauses after purity: 0
15.44/4.09	#    Propositional unsat core size     : 0
15.44/4.09	#    Propositional preprocessing time  : 0.000
15.44/4.09	#    Propositional encoding time       : 0.000
15.44/4.09	#    Propositional solver time         : 0.000
15.44/4.09	#    Success case prop preproc time    : 0.000
15.44/4.09	#    Success case prop encoding time   : 0.000
15.44/4.09	#    Success case prop solver time     : 0.000
15.44/4.09	# Current number of processed clauses  : 1533
15.44/4.09	#    Positive orientable unit clauses  : 202
15.44/4.09	#    Positive unorientable unit clauses: 4
15.44/4.09	#    Negative unit clauses             : 85
15.44/4.09	#    Non-unit-clauses                  : 1242
15.44/4.09	# Current number of unprocessed clauses: 63210
15.44/4.09	# ...number of literals in the above   : 400439
15.44/4.09	# Current number of archived formulas  : 0
15.44/4.09	# Current number of archived clauses   : 986
15.44/4.09	# Clause-clause subsumption calls (NU) : 341915
15.44/4.09	# Rec. Clause-clause subsumption calls : 56518
15.44/4.09	# Non-unit clause-clause subsumptions  : 515
15.44/4.09	# Unit Clause-clause subsumption calls : 5022
15.44/4.09	# Rewrite failures with RHS unbound    : 0
15.44/4.09	# BW rewrite match attempts            : 5221
15.44/4.09	# BW rewrite match successes           : 96
15.44/4.09	# Condensation attempts                : 3366
15.44/4.09	# Condensation successes               : 43
15.44/4.09	# Termbank termtop insertions          : 2565704
15.44/4.09	# Search garbage collected termcells   : 68884
15.44/4.09	
15.44/4.09	# -------------------------------------------------
15.44/4.09	# User time                : 2.846 s
15.44/4.09	# System time              : 0.101 s
15.44/4.09	# Total time               : 2.947 s
15.44/4.09	# Maximum resident set size: 13364 pages
15.44/4.09	
15.44/4.09	# -------------------------------------------------
15.44/4.09	# User time                : 9.707 s
15.44/4.09	# System time              : 0.328 s
15.44/4.09	# Total time               : 10.036 s
15.44/4.09	# Maximum resident set size: 7412 pages
15.44/4.09	% E---3.1 exiting
15.44/4.09	% E exiting
15.44/4.09	EOF
